Description: 代码很好的实现了基于a-star的最短路径寻找算法，并可以对寻找的路径有一个限制-Code is a good realization of a-star-based shortest path search algorithms, and can find the path there is a limit Platform: |
Size: 20480 |
Author:赵红丽 |
Hits:
Description: A*搜寻算法，俗称A星算法。这是一种在图形平面上，有多个节点的路径，求出最低通过成本的算法。常用于游戏中的NPC的移动计算，或线上游戏的BOT的移动计算上。-A* search algorithm, called A Star algorithm. This is a plane in the graphics, there are multiple nodes in the path, find the lowest cost method adopted. Commonly used in game NPC' s mobile computing, or online games on mobile computing BOT. Platform: |
Size: 84992 |
Author:ligang |
Hits:
Description: 本程序用来实现八数码难题。采用A星算法，设计程序，求出从初始状态到目标状态的最优路径，并给出问题的状态表示、编码规则、搜索算法分析、简单程序说明和求得的最优路径。编程方法新颖，思路清晰明了。-This procedure used to achieve the eight puzzle. A star algorithm used, the design process, from initial state to find the optimal path to goal state, and gives the state the problem that the encoding rules, the search algorithm analysis, a simple description of the procedures and obtain the optimal path. Programming approach is novel, thinking clear. Platform: |
Size: 266240 |
Author:abler |
Hits:
Description: 算法简述：A星路径搜索(采用二叉堆)，最短路径寻路算法-Algorithm Description: A star path search (using the binary heap), the shortest path Algorithm for Route Platform: |
Size: 51200 |
Author:zhongkeli |
Hits:
Description: C++版的A*（A-star,即A星）算法。对于栅格数据的最优路径搜索有不俗的表现。集成到你的程序也很容易。里面有两个例子可供参考。-C++ version of A* (A-star A star) algorithm. Have good performance for the optimal path to the raster data search. Is also very easy to integrate into your program. There are two examples for reference. Platform: |
Size: 619520 |
Author:刘辉 |
Hits:
Description: 运用matlab语言，A*算法实现移动机器人路径规划-Path Planning: A* Algorithm
Navigating a terrain and finding the shortest path to a Goal location is one of the
fundamental problems in path planning. While there are many approaches to this problem, one of
the most common and widely known is the A Star search. Platform: |
Size: 2048 |
Author:季玉慧 |
Hits:
Description: （被EI收录，不错的文章）传统A*算法在栅格地图上进行路径规划时，求解得到的路径长度不是最短并且转折点较多。针对这些不足，提出了一种改进A*算法，将传统A*算法的可搜索邻域个数从离散的8个拓展为无限个，可以沿任意方向进行搜索。这样不仅求解出来的路径长度更短，并且大大降低了其转折点的个数。该算法被应用于自主研发的“智能先锋”号系列无人驾驶车辆上，实车试验以及它们在“中国智能车未来挑战赛”中的优异表现证明该方法能够在栅格地图中求解出一条更优的可行驶路径，可以显著提升无人驾驶车辆行驶的效率和平稳性。-The paths obtained by conventional A* algorithm in grid map are usually not the optimal solutions, which have many turning nodes. To solve these problems, an improved A*algorithm is presented. In this method, the number of searchable neighbourhood is extended to infinite (basic A*algorithm has 8 discrete searchable neighbourhoods), and the search direction can be arbitrary. As a result, the path produced by the improved A*is much shorter and the number of turning nodes is greatly reduced. The proposed method is implemented on our self-developed unmanned vehicle, Intelligent Pioneer. The vehicle experiments and its good performance in the Intelligent Vehicle Future Challenge of China show that the resulting path of our method is more optimal, which observably improves the driving efficiency and stationarity of the unmanned vehicles. Platform: |
Size: 600064 |
Author:王辉 |
Hits:
Description: 将本目录设为当前目录后，请直接运行A_Star_Search_Algorithm.m
根据GUI界面进行操作：初始点、目标点的设置；
障碍网格的修改
网格和路径的更新
设置完毕后请单击search-The catalog to the current directory, run directly A_Star_Search_Algorithm.m operate in accordance with GUI interface: the initial point, the target point setting click the search after the obstacle mesh grid and modify the path set up update Platform: |
Size: 15360 |
Author:雪林 |
Hits:
Description: A星寻路算法，实现图形中路径的搜索和规划最短路径的功能。-A star pathfinding algorithm, search functions and planning the shortest path in the graph path. Platform: |
Size: 5628928 |
Author:wang |
Hits:
Description: 空间进行路径搜索，具有避障功能，该方法具有自主性，高效性，可在高空间搜索(The path search in space has the function of avoiding obstacles. The method is independent and efficient, and it can search in high space.) Platform: |
Size: 3072 |
Author:唯愿次风吹1 |
Hits:
Description: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(The A* search algorithm is commonly known as the A-star algorithm. The A* algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization [. It is unique in that it introduces global information when examining every possible node in the shortest path, estimates the distance from the current node to the end point, and serves as a measure of the probability that the node is on the shortest route.) Platform: |
Size: 724992 |
Author:xiaoqiangzi |
Hits:
Search - a star search path